Symbolic Constraints in Constructive Geometric Constraint Solving

نویسندگان

  • Christoph M. Hoffmann
  • Robert Joan-Arinyo
چکیده

In design and manufacturing applications users of computer aided de sign systems want to de ne relationships between dimension variables since such relationships express design intent very exibly This work reports on a technique developed to enhance a class of constructive geometric con straint solvers with the capability of managing functional relationships be tween dimension variables The method is shown to be correct Work supported in part by ONR Contract N J and by NSF Grants CDA ECD and CCR While on leave in the Department of Computer Sciences Purdue University Partially sup ported by a CIRIT fellowship of the Government of Catalonia under grant BEAI

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

J. Symbolic Computation (1996) 11, 1{000 Symbolic Constraints in Constructive Geometric Constraint Solving

In design and manufacturing applications, users of computer aided design systems want to de ne relationships between dimension variables, since such relationships express design intent very exibly. This work reports on a technique developed to enhance a class of constructive geometric constraint solvers with the capability of managing functional relationships between dimension variables. The me...

متن کامل

A 2D geometric constraint solver using a graph reduction method

Keywords: Geometric constraints Modeling by constraints Graph-constructive solver Decomposition–recombination (DR) planning Graph algorithms Under-constrained problems a b s t r a c t Modeling by constraints enables users to describe shapes by specifying relationships between geometric elements. These relationships are called constraints. A constraint solver derives then automatically the desig...

متن کامل

A Geometric Relaxation Solver for Parametric Constraint-Based Models

In this paper, a new relaxation algorithm for solving geometric constraint-based models is proposed. The algorithm starts from a constructive symbolic representation of objects (Constructive Parametric Solid Model, CPSM) and proceeds by iterative relaxation of the geometric constraints. Models that can be reduced to distance and angle constraints can be handled. A new algorithm based on an iter...

متن کامل

Encoding Relative Orientation and Mereotopology Relations with Geometric Constraints in CLP(QS)

One approach for encoding the semantics of spatial relations within a declarative programming framework is by systems of polynomial constraints. However, solving such constraints is computationally intractable in general (i.e. the theory of realclosed fields), and thus far the proposed symbolic algebraic methods do not scale to real world problems. In this paper we address this intractability b...

متن کامل

A Systematic Framework for Solving Geometric Constraints Analytically

A systematic framework is presented for solving algebraic equations arising in geometric constraint solving. The framework has been used successfully to solve a family of spatial geometric constraint problems. The approach combines geometric reasoning, symbolic reduction, and homotopy continuation.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Symb. Comput.

دوره 23  شماره 

صفحات  -

تاریخ انتشار 1997